Lecture Notes in Computer Science 4833
نویسندگان
چکیده
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 2 − 1. Although this factorization is orders of magnitude ‘easier’ than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of the latter computation.
منابع مشابه
Lecture Notes in Artificial Intelligence 4451 Edited by J . G . Carbonell and J . Siekmann Subseries of Lecture Notes in Computer Science
متن کامل
Progress in Cryptology - AFRICACRYPT 2011 - 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings
information security practice and experience 10th international conference ispec 2014 fuzhou china may 5-8 2014 proceedings lecture notes in computer science security and cryptology PDF advances in cryptology-asiacrypt 96 international conference on the theory and applications of crypotology and information security kyongju lecture notes in computer science PDF image analysis 17th scandinavian ...
متن کامل